<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.11"/>
<title>Clause: src/hat-trie/include/tsl/array-hash/array_growth_policy.h 源文件</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Clause
   &#160;<span id="projectnumber">1.0</span>
   </div>
   <div id="projectbrief">Chatopera Language Understanding Service.</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- 制作者 Doxygen 1.8.11 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'搜索');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>首页</span></a></li>
      <li><a href="pages.html"><span>相关页面</span></a></li>
      <li><a href="modules.html"><span>模块</span></a></li>
      <li><a href="namespaces.html"><span>命名空间</span></a></li>
      <li><a href="annotated.html"><span>类</span></a></li>
      <li class="current"><a href="files.html"><span>文件</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="搜索" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>文件列表</span></a></li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="dir_8de35a112afe11bbc1e373705286d1f4.html">hat-trie</a></li><li class="navelem"><a class="el" href="dir_bf40197352127bca97b32a70eddad7d5.html">include</a></li><li class="navelem"><a class="el" href="dir_d63c2e6fb2c19bee7e35bf7e1c5514f8.html">tsl</a></li><li class="navelem"><a class="el" href="dir_e9472025a567d0059ce6cc76b1c2367c.html">array-hash</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle">
<div class="title">array_growth_policy.h</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="preprocessor">#ifndef TSL_ARRAY_GROWTH_POLICY_H</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="preprocessor">#define TSL_ARRAY_GROWTH_POLICY_H </span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="preprocessor">#include &lt;algorithm&gt;</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="preprocessor">#include &lt;array&gt;</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="preprocessor">#include &lt;climits&gt;</span></div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="preprocessor">#include &lt;cmath&gt;</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="preprocessor">#include &lt;cstddef&gt;</span></div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="preprocessor">#include &lt;iterator&gt;</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="preprocessor">#include &lt;limits&gt;</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="preprocessor">#include &lt;ratio&gt;</span></div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="preprocessor">#include &lt;stdexcept&gt;</span></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;</div><div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="namespacetsl.html">   39</a></span>&#160;<span class="keyword">namespace </span><a class="code" href="namespacetsl.html">tsl</a> {</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="keyword">namespace </span>ah {</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;    </div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;<span class="keyword">template</span>&lt;std::<span class="keywordtype">size_t</span> GrowthFactor&gt;</div><div class="line"><a name="l00049"></a><span class="lineno"><a class="line" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html">   49</a></span>&#160;<span class="keyword">class </span><a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html">power_of_two_growth_policy</a> {</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;<span class="keyword">public</span>:</div><div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a0a10cf1f87f76dc2254fbd97152fafd7">   58</a></span>&#160;    <span class="keyword">explicit</span> <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a0a10cf1f87f76dc2254fbd97152fafd7">power_of_two_growth_policy</a>(std::size_t&amp; min_bucket_count_in_out) {</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        <span class="keywordflow">if</span>(min_bucket_count_in_out &gt; <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a48d9bdb9c10caf6771069660d1608d40">max_bucket_count</a>()) {</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;            <span class="keywordflow">throw</span> std::length_error(<span class="stringliteral">&quot;The hash table exceeds its maxmimum size.&quot;</span>);</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        }</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;        </div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        <span class="keywordflow">if</span>(min_bucket_count_in_out &gt; 0) {</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;            min_bucket_count_in_out = round_up_to_power_of_two(min_bucket_count_in_out);</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;            m_mask = min_bucket_count_in_out - 1;</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;        }</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;        <span class="keywordflow">else</span> {</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;            m_mask = 0;</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;        }</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;    }</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;    </div><div class="line"><a name="l00076"></a><span class="lineno"><a class="line" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a58c8859eb849b312919e964b3cf0672e">   76</a></span>&#160;    std::size_t <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a58c8859eb849b312919e964b3cf0672e">bucket_for_hash</a>(std::size_t hash) <span class="keyword">const</span> noexcept {</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;        <span class="keywordflow">return</span> hash &amp; m_mask;</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;    }</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;    </div><div class="line"><a name="l00083"></a><span class="lineno"><a class="line" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a4313be750fd9062f0b104e7d69e8e533">   83</a></span>&#160;    std::size_t <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a4313be750fd9062f0b104e7d69e8e533">next_bucket_count</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;        <span class="keywordflow">if</span>((m_mask + 1) &gt; <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a48d9bdb9c10caf6771069660d1608d40">max_bucket_count</a>() / GrowthFactor) {</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;            <span class="keywordflow">throw</span> std::length_error(<span class="stringliteral">&quot;The hash table exceeds its maxmimum size.&quot;</span>);</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        }</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        </div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        <span class="keywordflow">return</span> (m_mask + 1) * GrowthFactor;</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;    }</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;    </div><div class="line"><a name="l00094"></a><span class="lineno"><a class="line" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a48d9bdb9c10caf6771069660d1608d40">   94</a></span>&#160;    std::size_t <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a48d9bdb9c10caf6771069660d1608d40">max_bucket_count</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;        <span class="comment">// Largest power of two.</span></div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;        <span class="keywordflow">return</span> (std::numeric_limits&lt;std::size_t&gt;::max() / 2) + 1;</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;    }</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;    </div><div class="line"><a name="l00103"></a><span class="lineno"><a class="line" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a974dc74b65f9449d21ddd53a7cbc9982">  103</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a974dc74b65f9449d21ddd53a7cbc9982">clear</a>() noexcept {</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        m_mask = 0;</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;    }</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;    </div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;<span class="keyword">private</span>:</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;    <span class="keyword">static</span> std::size_t round_up_to_power_of_two(std::size_t value) {</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;        <span class="keywordflow">if</span>(is_power_of_two(value)) {</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;            <span class="keywordflow">return</span> value;</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;        }</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        </div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;        <span class="keywordflow">if</span>(value == 0) {</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;            <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;        }</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;            </div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;        --value;</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;        <span class="keywordflow">for</span>(std::size_t i = 1; i &lt; <span class="keyword">sizeof</span>(std::size_t) * CHAR_BIT; i *= 2) {</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;            value |= value &gt;&gt; i;</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;        }</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;        </div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;        <span class="keywordflow">return</span> value + 1;</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;    }</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;    </div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;    <span class="keyword">static</span> constexpr <span class="keywordtype">bool</span> is_power_of_two(std::size_t value) {</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;        <span class="keywordflow">return</span> value != 0 &amp;&amp; (value &amp; (value - 1)) == 0;</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;    }</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;    </div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;<span class="keyword">protected</span>:</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;    static_assert(is_power_of_two(GrowthFactor) &amp;&amp; GrowthFactor &gt;= 2, <span class="stringliteral">&quot;GrowthFactor must be a power of two &gt;= 2.&quot;</span>);</div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;    </div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;    std::size_t m_mask;</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;};</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> GrowthFactor = std::ratio&lt;3, 2&gt;&gt;</div><div class="line"><a name="l00141"></a><span class="lineno"><a class="line" href="classtsl_1_1ah_1_1mod__growth__policy.html">  141</a></span>&#160;<span class="keyword">class </span><a class="code" href="classtsl_1_1ah_1_1mod__growth__policy.html">mod_growth_policy</a> {</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;<span class="keyword">public</span>:</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;    <span class="keyword">explicit</span> <a class="code" href="classtsl_1_1ah_1_1mod__growth__policy.html">mod_growth_policy</a>(std::size_t&amp; min_bucket_count_in_out) {</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;        <span class="keywordflow">if</span>(min_bucket_count_in_out &gt; <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a48d9bdb9c10caf6771069660d1608d40">max_bucket_count</a>()) {</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;            <span class="keywordflow">throw</span> std::length_error(<span class="stringliteral">&quot;The hash table exceeds its maxmimum size.&quot;</span>);</div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;        }</div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;        </div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;        <span class="keywordflow">if</span>(min_bucket_count_in_out &gt; 0) {</div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;            m_mod = min_bucket_count_in_out;</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;        }</div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;        <span class="keywordflow">else</span> {</div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;            m_mod = 1;</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;        }</div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;    }</div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;    </div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;    std::size_t <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a58c8859eb849b312919e964b3cf0672e">bucket_for_hash</a>(std::size_t hash) <span class="keyword">const</span> noexcept {</div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;        <span class="keywordflow">return</span> hash % m_mod;</div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;    }</div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;    </div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;    std::size_t <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a4313be750fd9062f0b104e7d69e8e533">next_bucket_count</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;        <span class="keywordflow">if</span>(m_mod == <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a48d9bdb9c10caf6771069660d1608d40">max_bucket_count</a>()) {</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;            <span class="keywordflow">throw</span> std::length_error(<span class="stringliteral">&quot;The hash table exceeds its maxmimum size.&quot;</span>);</div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;        }</div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;        </div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;        <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a4313be750fd9062f0b104e7d69e8e533">next_bucket_count</a> = std::ceil(<span class="keywordtype">double</span>(m_mod) * REHASH_SIZE_MULTIPLICATION_FACTOR);</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;        <span class="keywordflow">if</span>(!std::isnormal(next_bucket_count)) {</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;            <span class="keywordflow">throw</span> std::length_error(<span class="stringliteral">&quot;The hash table exceeds its maxmimum size.&quot;</span>);</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;        }</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;        </div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;        <span class="keywordflow">if</span>(next_bucket_count &gt; <span class="keywordtype">double</span>(<a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a48d9bdb9c10caf6771069660d1608d40">max_bucket_count</a>())) {</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a48d9bdb9c10caf6771069660d1608d40">max_bucket_count</a>();</div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;        }</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;        <span class="keywordflow">else</span> {</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;            <span class="keywordflow">return</span> std::size_t(next_bucket_count);</div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;        }</div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;    }</div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;    </div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;    std::size_t <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a48d9bdb9c10caf6771069660d1608d40">max_bucket_count</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;        <span class="keywordflow">return</span> MAX_BUCKET_COUNT;</div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;    }</div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;    </div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;    <span class="keywordtype">void</span> <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a974dc74b65f9449d21ddd53a7cbc9982">clear</a>() noexcept {</div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;        m_mod = 1;</div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;    }</div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;    </div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;<span class="keyword">private</span>:</div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;    <span class="keyword">static</span> constexpr <span class="keywordtype">double</span> REHASH_SIZE_MULTIPLICATION_FACTOR = 1.0 * GrowthFactor::num / GrowthFactor::den;</div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;    <span class="keyword">static</span> <span class="keyword">const</span> std::size_t MAX_BUCKET_COUNT = </div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;            std::size_t(<span class="keywordtype">double</span>(</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;                    std::numeric_limits&lt;std::size_t&gt;::max() / REHASH_SIZE_MULTIPLICATION_FACTOR</div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;            ));</div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;            </div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;    static_assert(REHASH_SIZE_MULTIPLICATION_FACTOR &gt;= 1.1, <span class="stringliteral">&quot;Growth factor should be &gt;= 1.1.&quot;</span>);</div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;    </div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;    std::size_t m_mod;</div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;};</div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;</div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;</div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;<span class="keyword">namespace </span>detail {</div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;</div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;<span class="keyword">static</span> constexpr <span class="keyword">const</span> std::array&lt;std::size_t, 40&gt; PRIMES = {{</div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;    1ul, 5ul, 17ul, 29ul, 37ul, 53ul, 67ul, 79ul, 97ul, 131ul, 193ul, 257ul, 389ul, 521ul, 769ul, 1031ul, </div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;    1543ul, 2053ul, 3079ul, 6151ul, 12289ul, 24593ul, 49157ul, 98317ul, 196613ul, 393241ul, 786433ul, </div><div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;    1572869ul, 3145739ul, 6291469ul, 12582917ul, 25165843ul, 50331653ul, 100663319ul, 201326611ul, </div><div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;    402653189ul, 805306457ul, 1610612741ul, 3221225473ul, 4294967291ul</div><div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;}};</div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;</div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;<span class="keyword">template</span>&lt;<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> IPrime&gt;</div><div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;<span class="keyword">static</span> constexpr std::size_t mod(std::size_t hash) { <span class="keywordflow">return</span> hash % PRIMES[IPrime]; }</div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;</div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;<span class="comment">// MOD_PRIME[iprime](hash) returns hash % PRIMES[iprime]. This table allows for faster modulo as the</span></div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;<span class="comment">// compiler can optimize the modulo code better with a constant known at the compilation.</span></div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;<span class="keyword">static</span> constexpr <span class="keyword">const</span> std::array&lt;std::size_t(*)(std::size_t), 40&gt; MOD_PRIME = {{ </div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;    &amp;mod&lt;0&gt;, &amp;mod&lt;1&gt;, &amp;mod&lt;2&gt;, &amp;mod&lt;3&gt;, &amp;mod&lt;4&gt;, &amp;mod&lt;5&gt;, &amp;mod&lt;6&gt;, &amp;mod&lt;7&gt;, &amp;mod&lt;8&gt;, &amp;mod&lt;9&gt;, &amp;mod&lt;10&gt;, </div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;    &amp;mod&lt;11&gt;, &amp;mod&lt;12&gt;, &amp;mod&lt;13&gt;, &amp;mod&lt;14&gt;, &amp;mod&lt;15&gt;, &amp;mod&lt;16&gt;, &amp;mod&lt;17&gt;, &amp;mod&lt;18&gt;, &amp;mod&lt;19&gt;, &amp;mod&lt;20&gt;, </div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;    &amp;mod&lt;21&gt;, &amp;mod&lt;22&gt;, &amp;mod&lt;23&gt;, &amp;mod&lt;24&gt;, &amp;mod&lt;25&gt;, &amp;mod&lt;26&gt;, &amp;mod&lt;27&gt;, &amp;mod&lt;28&gt;, &amp;mod&lt;29&gt;, &amp;mod&lt;30&gt;, </div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;    &amp;mod&lt;31&gt;, &amp;mod&lt;32&gt;, &amp;mod&lt;33&gt;, &amp;mod&lt;34&gt;, &amp;mod&lt;35&gt;, &amp;mod&lt;36&gt;, &amp;mod&lt;37&gt; , &amp;mod&lt;38&gt;, &amp;mod&lt;39&gt;</div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;}};</div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;</div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;}</div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;</div><div class="line"><a name="l00247"></a><span class="lineno"><a class="line" href="classtsl_1_1ah_1_1prime__growth__policy.html">  247</a></span>&#160;<span class="keyword">class </span><a class="code" href="classtsl_1_1ah_1_1prime__growth__policy.html">prime_growth_policy</a> {</div><div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;<span class="keyword">public</span>:</div><div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;    <span class="keyword">explicit</span> <a class="code" href="classtsl_1_1ah_1_1prime__growth__policy.html">prime_growth_policy</a>(std::size_t&amp; min_bucket_count_in_out) {</div><div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;        <span class="keyword">auto</span> it_prime = std::lower_bound(detail::PRIMES.begin(), </div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;                                         detail::PRIMES.end(), min_bucket_count_in_out);</div><div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;        <span class="keywordflow">if</span>(it_prime == detail::PRIMES.end()) {</div><div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;            <span class="keywordflow">throw</span> std::length_error(<span class="stringliteral">&quot;The hash table exceeds its maxmimum size.&quot;</span>);</div><div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;        }</div><div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;        </div><div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;        m_iprime = <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">&gt;</span>(std::distance(detail::PRIMES.begin(), it_prime));</div><div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;        <span class="keywordflow">if</span>(min_bucket_count_in_out &gt; 0) {</div><div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;            min_bucket_count_in_out = *it_prime;</div><div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;        }</div><div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;        <span class="keywordflow">else</span> {</div><div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;            min_bucket_count_in_out = 0;</div><div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;        }</div><div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;    }</div><div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;    </div><div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;    std::size_t <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a58c8859eb849b312919e964b3cf0672e">bucket_for_hash</a>(std::size_t hash) <span class="keyword">const</span> noexcept {</div><div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;        <span class="keywordflow">return</span> detail::MOD_PRIME[m_iprime](hash);</div><div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;    }</div><div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;    </div><div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;    std::size_t <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a4313be750fd9062f0b104e7d69e8e533">next_bucket_count</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;        <span class="keywordflow">if</span>(m_iprime + 1 &gt;= detail::PRIMES.size()) {</div><div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;            <span class="keywordflow">throw</span> std::length_error(<span class="stringliteral">&quot;The hash table exceeds its maxmimum size.&quot;</span>);</div><div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;        }</div><div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;        </div><div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;        <span class="keywordflow">return</span> detail::PRIMES[m_iprime + 1];</div><div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;    }   </div><div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;    </div><div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;    std::size_t <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a48d9bdb9c10caf6771069660d1608d40">max_bucket_count</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;        <span class="keywordflow">return</span> detail::PRIMES.back();</div><div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;    }</div><div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;    </div><div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;    <span class="keywordtype">void</span> <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a974dc74b65f9449d21ddd53a7cbc9982">clear</a>() noexcept {</div><div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;        m_iprime = 0;</div><div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;    }</div><div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;    </div><div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;<span class="keyword">private</span>:</div><div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> m_iprime;</div><div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;    </div><div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;    static_assert(std::numeric_limits&lt;decltype(m_iprime)&gt;::max() &gt;= detail::PRIMES.size(), </div><div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;                  <span class="stringliteral">&quot;The type of m_iprime is not big enough.&quot;</span>);</div><div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;}; </div><div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;</div><div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;}</div><div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;}</div><div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;</div><div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;<span class="preprocessor">#endif</span></div><div class="ttc" id="namespacetsl_html"><div class="ttname"><a href="namespacetsl.html">tsl</a></div><div class="ttdef"><b>Definition:</b> array_growth_policy.h:39</div></div>
<div class="ttc" id="classtsl_1_1ah_1_1power__of__two__growth__policy_html_a48d9bdb9c10caf6771069660d1608d40"><div class="ttname"><a href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a48d9bdb9c10caf6771069660d1608d40">tsl::ah::power_of_two_growth_policy::max_bucket_count</a></div><div class="ttdeci">std::size_t max_bucket_count() const </div><div class="ttdef"><b>Definition:</b> array_growth_policy.h:94</div></div>
<div class="ttc" id="classtsl_1_1ah_1_1power__of__two__growth__policy_html_a0a10cf1f87f76dc2254fbd97152fafd7"><div class="ttname"><a href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a0a10cf1f87f76dc2254fbd97152fafd7">tsl::ah::power_of_two_growth_policy::power_of_two_growth_policy</a></div><div class="ttdeci">power_of_two_growth_policy(std::size_t &amp;min_bucket_count_in_out)</div><div class="ttdef"><b>Definition:</b> array_growth_policy.h:58</div></div>
<div class="ttc" id="classtsl_1_1ah_1_1power__of__two__growth__policy_html_a4313be750fd9062f0b104e7d69e8e533"><div class="ttname"><a href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a4313be750fd9062f0b104e7d69e8e533">tsl::ah::power_of_two_growth_policy::next_bucket_count</a></div><div class="ttdeci">std::size_t next_bucket_count() const </div><div class="ttdef"><b>Definition:</b> array_growth_policy.h:83</div></div>
<div class="ttc" id="classtsl_1_1ah_1_1power__of__two__growth__policy_html_a974dc74b65f9449d21ddd53a7cbc9982"><div class="ttname"><a href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a974dc74b65f9449d21ddd53a7cbc9982">tsl::ah::power_of_two_growth_policy::clear</a></div><div class="ttdeci">void clear() noexcept</div><div class="ttdef"><b>Definition:</b> array_growth_policy.h:103</div></div>
<div class="ttc" id="classtsl_1_1ah_1_1mod__growth__policy_html"><div class="ttname"><a href="classtsl_1_1ah_1_1mod__growth__policy.html">tsl::ah::mod_growth_policy</a></div><div class="ttdef"><b>Definition:</b> array_growth_policy.h:141</div></div>
<div class="ttc" id="classtsl_1_1ah_1_1power__of__two__growth__policy_html_a58c8859eb849b312919e964b3cf0672e"><div class="ttname"><a href="classtsl_1_1ah_1_1power__of__two__growth__policy.html#a58c8859eb849b312919e964b3cf0672e">tsl::ah::power_of_two_growth_policy::bucket_for_hash</a></div><div class="ttdeci">std::size_t bucket_for_hash(std::size_t hash) const noexcept</div><div class="ttdef"><b>Definition:</b> array_growth_policy.h:76</div></div>
<div class="ttc" id="classtsl_1_1ah_1_1power__of__two__growth__policy_html"><div class="ttname"><a href="classtsl_1_1ah_1_1power__of__two__growth__policy.html">tsl::ah::power_of_two_growth_policy</a></div><div class="ttdef"><b>Definition:</b> array_growth_policy.h:49</div></div>
<div class="ttc" id="classtsl_1_1ah_1_1prime__growth__policy_html"><div class="ttname"><a href="classtsl_1_1ah_1_1prime__growth__policy.html">tsl::ah::prime_growth_policy</a></div><div class="ttdef"><b>Definition:</b> array_growth_policy.h:247</div></div>
</div><!-- fragment --></div><!-- contents -->
<address class="footer">
    <small>
        &nbsp; Copyright (c) (2019-2020) &nbsp;<a href="https://www.chatopera.com">
            北京华夏春松科技有限公司
        </a>. All Rights Reserved
        &nbsp;
    </small>
</address>